A combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
نویسندگان
چکیده
The algorithm of Ant Colony System (ACS) has been found attractive for solving combinatorial optimization problem such as Travelling Salesman Problem (TSP). The run-time for this algorithm increases with increase in number of nodes. In this paper, we propose an efficient method that reduces the run-time for very large-scale Euclidean TSP problem and yet conserve the quality of solution for certain clustered cases. Moreover, the proposed method has a simple parallel implementation. The proposed method shows excellent performance both in run-time and quality of solution specially on large clustered instances. Effectiveness of the proposed method is underscored by applying them on two kinds of different benchmark problems. Key-Words: travelling salesman problem, ant colony optimization, clustering algorithms, combinatorial optimization.
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملParallel Implementation of Ant Colony Optimization for Travelling Salesman Problem
A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.
متن کاملClustering Evolutionary Computation for Solving Travelling Salesman Problems
This paper proposes the methods for solving the traveling salesman problems using clustering techniques and evolutionary methods. Gaussian mixer model and K-means clustering are two clustering techniques that are considered in this paper. The traveling salesman problems are clustered in order to group the nearest nodes in the problems. Then, the evolutionary methods are applied to each cluster....
متن کامل